Enhancing Real-time Scheduling of Divisible Loads by Utilizing Inserted Idle Time
نویسندگان
چکیده
Providing QoS and performance guarantees for arbitrarily divisible loads in a cluster has become a significant problem. While progress is being made in scheduling arbitrarily divisible loads, some of the proposed approaches may cause Inserted Idle Times (IITs) that are detrimental to system performance. Two contributions are made in addressing this problem. First, we propose two constraints that, when satisfied, lead to an optimal partitioning in utilizing IITs. Second, we integrate the new partitioning method with a previous approach and develop an enhanced algorithm that better utilizes IITs. Simulation results demonstrate the advantages of our new approach.
منابع مشابه
Technical Report UNL-CSE-2007-0013 Real-Time Divisible Load Scheduling with Different Processor Available Times
Abstract Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, some of proposed approaches may cause Inserted Idle Times (IITs) that are detrimental to system performance. In this paper we propose a new approach that uti...
متن کاملReal-Time Scheduling of Divisible Loads in Clusters to Handle Estimated Execution Time Inaccuracies
Quality of Service (QoS) provisioning for divisible loads in clusters, enabled using real-time scheduling theory, is based on an important assumption: the scheduler knows the execution time of every task in the workload. Information from production clusters, however, shows that user estimated task execution times are often inaccurate. In this paper, we present an approach to address this proble...
متن کاملBudgetary Constraints and Idle Time Allocation in Common-Cycle Production with non-zero Setup Time
Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...
متن کاملNo-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...
متن کاملReal-time scheduling of divisible loads in cluster computing environments
Cluster computing has become an important paradigm for solving large-scale problems. To enhance the quality of service (QoS) and provide performance guarantees in a cluster computing environment, various real-time scheduling algorithms and workload models have been investigated. Computational loads that can be arbitrarily divided into independent tasks represent many real-world applications. Ho...
متن کامل